On two convex autocorrelation regions for moving average processes
نویسندگان
چکیده
منابع مشابه
Moving Average Processes with Infinite Variance
The sample autocorrelation function (acf) of a stationary process has played a central statistical role in traditional time series analysis, where the assumption is made that the marginal distribution has a second moment. Now, the classical methods based on acf are not applicable in heavy tailed modeling. Using the codifference function as dependence measure for such processes be shown it be as...
متن کاملMoving Average Processes
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. Blackwell Publishing and Royal Statistical Society are col...
متن کاملTesting for Autocorrelation in the Autoregressive Moving Average Error Model
Failure to allow for autocorrelation of the disturbances in a regression model can lead to biased and inconsistent parameter estimates, particularly if the model is autoregressive. While consistent estimation methods are available which allow for autocorrelation, estimation is usually much easier when there is some assurance that autocorrelation is absent. In pursuit of such assurance the prese...
متن کاملPrediction in moving average processes
For the stationary invertible moving average process of order one with unknown innovation distribution F , we construct root-n consistent plug-in estimators of conditional expectations E(h(Xn+1)|X1, . . . , Xn). More specifically, we give weak conditions under which such estimators admit Bahadur type representations, assuming some smoothness of h or of F . For fixed h it suffices that h is loca...
متن کاملOn optimal bridges between two convex regions
Given k disjoint regions in the plane or space, the bridge problem asks for k − 1 line segments (optimal bridges) which connect these regions so as to minimize the length of the longest path between two points in the final connected region. We present O(n) and O(n2) time algorithms for finding an optimal bridge between two convex regions in the plane and space, respectively. An important proper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Biometrika
سال: 1976
ISSN: 0006-3444,1464-3510
DOI: 10.1093/biomet/63.3.681